Quick gossiping by telegraphs
نویسندگان
چکیده
منابع مشابه
Quick gossiping by telegraphs
We consider gossiping in the complete doubly directed graph, i.e. telegrams arranged in rounds are used to exchange information between n points each having one initial item. It is proved that at least 1:44. .. log 2 n rounds are needed to inform everybody about those n distinct items of information.
متن کاملFast Gossiping by Short Messages
Gossiping is the process of information diiusion in which each node of a network holds a packet that must be communicated to all other nodes in the network. We consider the problem of gossiping in communication networks under the restriction that communicating nodes can exchange up to a xed number p of packets at each round. In the rst part of the paper we study the extremal case p = 1 and we e...
متن کاملGossiping Capabilities
Gossip-based protocols are now acknowledged as a sound basis to implement collaborative high-bandwidth content dissemination: content location is disseminated through gossip, the actual contents being subsequently pulled. In this paper, we present HEAP, HEterogeneity-Aware Gossip Protocol, where nodes dynamically adjust their contribution to gossip dissemination according to their capabilities....
متن کاملCommunication Complexity of Gossiping by Packets
This paper considers the problem of gossiping with packets of limited size in a network with cost function. We show that the problem of determining the minimum cost necessary to perform gossiping among a given set of participants with packets of limited size is NP-hard. We also give an approximate (with respect to the cost) gossiping algorithm. The ratio between the cost of an optimal algorithm...
متن کاملOptimal Sequential Gossiping by Short Messages
Gossiping is the process of information diiusion in which each node of a network holds a block that must be communicated to all the other nodes in the network. We consider the problem of gossiping in communication networks under the restriction that communicating nodes can exchange up to a xed number p of blocks during each call. We study the minimum number of calls necessary to perform gossipi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1994
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)90290-9